An Algorithm to Compute
نویسندگان
چکیده
The following problem is addressed: given square matrices A and B, compute the smallest such that A + E and B + F have a common eigenvalue for some E, F with max(‖E‖2, ‖F‖2) ≤ . An algorithm to compute this quantity to any prescribed accuracy is presented, assuming that eigenvalues can be computed exactly.
منابع مشابه
An Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)
Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...
متن کاملA robust engineering approach for wind turbine blade profile aeroelastic computation
Wind turbines are important devices that extract clean energy from wind flow. The efficiency of wind turbines should be examined under various working conditions in order to estimate off-design performance. Numerous aerodynamic and structural research works have been carried out to compute aeroelastic effects on wind turbines. Most of them suffer from either the simplicity of the modelling appr...
متن کاملA robust engineering approach for wind turbine blade profile aeroelastic computation
Wind turbines are important devices that extract clean energy from wind flow. The efficiency of wind turbines should be examined under various working conditions in order to estimate off-design performance. Numerous aerodynamic and structural research works have been carried out to compute aeroelastic effects on wind turbines. Most of them suffer from either the simplicity of the modelling ...
متن کاملAn Improvement over Random Early Detection Algorithm: A Self-Tuning Approach
Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملارائه الگوریتم پویا برای تنظیم همروندی فرایندهای کسبوکار
Business process management systems (BPMS) are vital complex information systems to compete in the global market and to increase economic productivity. Workload balancing of resources in BPMS is one of the challenges have been long studied by researchers. Workload balancing of resources increases the system stability, improves the efficiency of the resources and enhances the quality of their pr...
متن کامل